Query Processing in Spatial Network Databases
نویسندگان
چکیده
Despite the importance of spatial networks in real-life applications, most of the spatial database literature focuses on Euclidean spaces. In this paper we propose an architecture that integrates network and Euclidean information, capturing pragmatic constraints. Based on this architecture, we develop a Euclidean restriction and a network expansion framework that take advantage of location and connectivity to efficiently prune the search space. These frameworks are successfully applied to the most popular spatial queries, namely nearest neighbors, range search, closest pairs and edistance joins, in the context of spatial network databases.
منابع مشابه
A k-Nearest Neighbor Search Algorithm for Enhancing Data Privacy in Outsourced Spatial Databases
With the advancement of cloud computing technologies and the propagation of locationbased services, research on outsourced spatial databases has been spotlighted. Therefore, the traditional spatial databases owners want to outsource their resources to a service provider so that they can reduce cost for storage and management. However, the issue of privacy preservation is crucial in spatial data...
متن کاملTSC-IRNN: Time- and Space-Constraint In-Route Nearest Neighbor Query Processing Algorithms in Spatial Network Databases
Although a large number of query processing algorithms in spatial network database (SNDB) have been studied, there exists little research on route-based queries. Since moving objects move only in spatial networks, route-based queries, like in-route nearest neighbor (IRNN), are essential for Location-based Service (LBS) and Telematics applications. However, the existing IRNN query processing alg...
متن کاملA k-Nearest Neighbor Search Algorithm for Privacy Preservation in Outsourced Spatial Databases
Traditional spatial databases owners outsource their resources to a cloud computing environment so that they can reduce cost for storage and management. However, the issue of privacy preservation is crucial in spatial database outsourcing since user location data is sensitive against unauthorized accesses. Existing privacy-preserving algorithms may reveal the original database from encrypted da...
متن کاملProcessing Queries on Road Networks in Spatial Data Base Perspective for Selectivity Estimation
This work mainly focuses on building a framework that is capable of analyzing spatial approximate substring queries, for mainly to solve the selectivity estimation problem of range queries which belongs to road networks represented in spatial databases. The selectivity estimation is nothing but estimating the size of the results i.e., estimating the number of points that presents in a graph whi...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملKNN Query Processing 0f Secured Multi Data Owner Using Voronoi Diagram
an economical and flexible way to data owners for delivering spatial data to users of location-based services would be Outsourcing spatial databases to the cloud. In this data outsourcing model the service provider can be untrustworthy. It may return incorrect or incomplete query results to clients intentionally or not. Ensuring spatial query integrity is critical. Here an efficient road networ...
متن کامل